How to Incorporate Negation in a Prolog Compiler
نویسندگان
چکیده
Knowledge representation based applications require a more complete set of capabilities than those ooered by conventional Prolog compilers. Negation is, probably, the most important one. The inclusion of negation among the logical facilities of LP has been a very active area of research, and several techniques have been proposed. However, the negation capabilities accepted by current Prolog compilers are very limited. In this paper, we discuss the possibility to incorporate some of these techniques in a Prolog compiler in an eecient way. Our idea is to mix some of the existing proposals guided by the information provided by a global analysis of the source code.
منابع مشابه
Efficient Implementation of General Negation Using Abstract Interpretation
While negation has been a very active area of research in logic programming, comparatively few papers have been devoted to implementation issues. Furthermore, the negation-related capabilities of current Prolog systems are limited. We recently presented a novel method for incorporating negation in a Prolog compiler which takes a number of existing methods (some modified and improved) and uses t...
متن کاملEecient Implementation of General Negation Using Abstract Interpretation
While negation has been a very active area of research in logic programming , comparatively few papers have been devoted to implementation issues. Furthermore, the negation-related capabilities of current Prolog systems are limited. We recently presented a novel method for incorporating negation in a Prolog compiler which takes a number of existing methods (some modiied and improved) and uses t...
متن کاملEfficient Negation Using Abstract Interpretation
While negation has been a very active área of research in logic programming, comparatively few papers have been devoted to implementation issues. Furthermore, the negation-related capabilities of current Prolog systems are limited. We recently presented a novel method for incorporating negation in a Prolog compiler which takes a number of existing methods (some modified and improved by us) and ...
متن کاملTheorem Prover : A New Exposition and Implementation in Prolog
A Prolog technology theorem prover (PTTP) is an extension of Prolog that is complete for the full rst-order predicate calculus. It di ers from Prolog in its use of uni cation with the occurs check for soundness, depthrst iterative-deepening search instead of unbounded depthrst search to make the search strategy complete, and the model elimination reduction rule that is added to Prolog inference...
متن کاملLearning Action Descriptions with A-Prolog: Action Language C
This paper demonstrates how A-Prolog can be used to solve the problem of non-monotonic inductive learning in the context of the learning of the behavior of dynamic domains. Non-monotonic inductive learning is an extension of traditional inductive learning, characterized by the use of default negation in the background knowledge and/or in the clauses being learned. The importance of non-monotoni...
متن کامل